On Sumsets and Convex Hull

نویسندگان

  • Károly J. Böröczky
  • Francisco Santos
  • Oriol Serra
چکیده

One classical result of Freiman gives the optimal lower bound for the cardinality of A + A if A is a d-dimensional finite set in R. Matolcsi and Ruzsa have recently generalized this lower bound to |A+ kB| if B is d-dimensional, and A is contained in the convex hull of B. We characterize the equality case of the Matolcsi–Ruzsa bound. The argument is based partially on understanding triangulations of polytopes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic Proof for the Geometric Structure of Sumsets

We consider a finite set of lattice points and their convex hull. The author previously gave a geometric proof that the sumsets of these lattice points take over the central regions of dilated convex hulls, thus revealing an interesting connection between additive number theory and geometry. In this paper, we will see an algebraic proof of this fact when the convex hull of points is a simplex, ...

متن کامل

Sumsets and the Convex Hull

We extend Freiman's inequality on the cardinality of the sumset of a d dimensional set. We consider different sets related by an inclusion of their convex hull, and one of them added possibly several times.

متن کامل

Quantitative stability for sumsets in R

Given a measurable set A ⊂ R of positive measure, it is not difficult to show that |A+A| = |2A| if and only if A is equal to its convex hull minus a set of measure zero. We investigate the stability of this statement: If (|A + A| − |2A|)/|A| is small, is A close to its convex hull? Our main result is an explicit control, in arbitrary dimension, on the measure of the difference between A and its...

متن کامل

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

L-CONVEX SYSTEMS AND THE CATEGORICAL ISOMORPHISM TO SCOTT-HULL OPERATORS

The concepts of $L$-convex systems and Scott-hull spaces are proposed on frame-valued setting. Also, we establish the categorical isomorphism between  $L$-convex systems and Scott-hull spaces. Moreover, it is proved that the category of $L$-convex structures is  bireflective in the category of $L$-convex systems. Furthermore, the quotient systems of $L$-convex systems are studied.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2014